Indexing Techniques in Data Warehousing Environment The UB-Tree Algorithm

The indexing techniques in multidimensional databases are becoming more and more important. The data warehouse environment has become a popular technology and a lot of research work has been done in order to improve the query performance and to provide faster response times. The ability to answer these queries e fficiently is a critical issue since most of them are complex and iterative. In this paper, we discuss some multidimensional access methods and how they have shown high potential for significant performance in various application domains. We investigate the usability and performance of the UB-Tree (Universal B-Tree) as one of these multidimensional access methods/ The UB-Tree is a very promising multidimensional index, which has shown superiority over traditional access methods in different scenarios, especially in OLAP applications.